An Intelligent Bi-Directional Parallel B* Routing Algorithm
نویسندگان
چکیده
منابع مشابه
Bi-directional Search in QoS Routing
The ”bi-directional search method” used for unicast routing is briefly reviewed. The extension of this method unicast QoS routing is discussed and an exact hybrid QoS algorithm HAMCRA that is partly based on bi-directional search is proposed. HAMCRA uses the speed of a heuristic when the constraints are loose and efficiently maintains exactness where heuristics fail. The performance of HAMCRA i...
متن کاملAn Improved Junction-Based Directional Routing Protocol (IJDRP) for VANETs
Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...
متن کاملFast Bi-directional SIFT Algorithm and Application
SIFT (Scale invariant feature transform) descriptor is one of the most effective local features that is used for scale, rotation and illumination invariant of automatic image registration. In this paper a fast bi-directional matching algorithm based on SIFT was proposed for improving match accuracy and reducing match time. Firstly the single-feature points and multi-feature points in two images...
متن کاملScalable sender access control for bi-directional multicast routing
Bi-directional shared tree is an efficient routing scheme for interactive multicast applications with multiple sources. Given the open-group IP multicast service model, it is important to support sender access control in order to prevent group members from receiving irrelevant data, and also to protect the multicast tree from Denial-of-Service (DoS) attacks. Compared with source specific and un...
متن کامل2FACE: Bi-Directional Face Traversal for Efficient Geometric Routing
We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and Communications
سال: 2020
ISSN: 2327-5219,2327-5227
DOI: 10.4236/jcc.2020.87001